Rewrite, Rewrite, Rewrite
نویسندگان
چکیده
We study properties of rewrite systems that are not necessarily terminating, but allow instead for trans nite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of in nitary theories. We also consider su cient completeness of hierarchical systems. Is there no limit? |Job 16:3
منابع مشابه
Simulation as a Correct Transformation of Rewrite Systems
Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in the original rewrite system. In this paper it is shown that if such a simulation is sound and complete and preserves termination, then the transformation of the original into the simulating rewrite system constitutes a correct...
متن کاملBottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems
Coquidt, J.-L., M. Dauchet, R. Gilleron and S. VBgviilgyi, Bottom-up tree pushdown automata: classification and connection with rewrite systems, Theoretical Computer Science 127 (1994) 69-98. We define different types of bottom-up tree pushdown automata and study their connections with rewrite systems. Along this line of research we complete and generalize the results of Gallier, Book and Salom...
متن کاملGeneric Completion ( Version 1 ) Reinhard
Abstract rewrite systems define a reduction relation by a set of rules. An important aspect of such rewrite relations is their behavior in an arbitrary context associated with the underlying congruence relation. This behavior is described by “compatibility properties”: a rewrite system is compatible if applying the same context to two objects preserves the rewrite relation among them. We presen...
متن کاملA Rewrite Stack Machine for Roc! a Rewrite Stack Machine for Roc! *
ROC! is a deterministic rewrite strategy language which includes the rewrite rulesas basic operators, and the deterministic choice and the repetition as high-level strategyoperators. In this paper we present a method which, for a given term rewriting system(TRS) R, constructs a new TRS R such that R-rewriting is equivalent (sound and com-plete) with R-rewriting constrained by RO...
متن کاملReachability is Decidable for Ground AC Rewrite Systems
The reachability problem for ground associative-commutative (AC) rewrite systems is decidable. We show that ground AC rewrite systems are equivalent to Process Rewrite Systems (PRS) for which reach-ability is decidable 4]. However, the decidability proofs for PRS are cumbersome and thus we present a simpler and more readable proof in the framework of ground AC rewrite systems. Moreover, we show...
متن کاملProbabilistic Rewrite Theories
We propose probabilistic rewrite theories as a general semantic framework supporting highlevel specification of probabilistic systems that can be massively concurrent. We give the definition and semantics of probabilistic rewrite theories and discuss the mappings between different classes of theories and models. We then define the semantics of probabilistic temporal formulae for a given probabi...
متن کامل